Determination of Error Values for Decoding Hermitian Codes with the Inverse Affine Fourier Transform
نویسنده
چکیده
With the knowledge of the syndromes Sa,b, 0 ≤ a, b ≤ q − 2, the exact error values cannot be determined by using the conventional (q − 1)2-point discrete Fourier transform in the decoding of a plane algebraic-geometric code over GF (q). In this letter, the inverse q-point 1-dimensional and q2-point 2dimensional affine Fourier transform over GF (q) are presented to be used to retrieve the actual error values, but it requires much computation efforts. For saving computation complexity, a modification of the affine Fourier transform is derived by using the property of the rational points of the plane Hermitian curve. The modified transform, which has almost the same computation complexity of the conventional discrete Fourier transform, requires the knowledge of syndromes Sa,b, 0 ≤ a, b ≤ q − 2, and three more extended syndromes Sq−1,q−1, S0,q−1, Sq−1,0. key words: algebraic-geometric code, Hermitian code, affine Fourier transform, error value
منابع مشابه
One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملImproved decoding of affine–variety codes
We provide a decoding technique for affine-variety codes using a multidimensional extension of general error locator polynomials. We prove the existence of such polynomials for any affine-variety code and hence for any linear code. We compute some interesting cases, including Hermitian codes.
متن کاملOn Computation of Error Locations and Values in Hermitian Codes
We obtain a technique to reduce the computational complexity associated with decoding of Hermitian codes. In particular, we propose a method to compute the error locations and values using an uni-variate error locator and an uni-variate error evaluator polynomial. To achieve this, we introduce the notion of Semi-Erasure Decoding of Hermitian codes and prove that decoding of Hermitian codes can ...
متن کاملFourier Codes
A new family of error-correcting codes, called Fourier codes, is introduced. The code parity-check matrix, dimension and an upper bound on its minimum distance are obtained from the eigenstructure of the Fourier number theoretic transform. A decoding technique for such codes is proposed. Index Terms – finite field Fourier transform, number theoretic transform, eigensequences, linear block codes.
متن کاملOn Erasure Decoding of AG-codes
We present a scheme for erasure decoding of AG-codes of complexity O(n2). This improves on methods involving Fourier transforms. The trivial scheme for erasure decoding of AG-codes (Algebraic Geometry codes in full, or Geometric Goppa codes) solves a system of linear equations. The scheme is of complexity O(n), where n denotes the codelength. Fast schemes, that use a Fourier transform of all sy...
متن کامل